Simultaneous Diagonalization via Congruence of Hermitian Matrices: Some Equivalent Conditions and a Numerical Solution

نویسندگان

چکیده

This paper aims at solving the Hermitian SDC problem, i.e., that of \textit{simultaneously diagonalizing via $*$-congruence} a collection finitely many (not need pairwise commute) matrices. Theoretically, we provide some equivalent conditions for such matrix can be simultaneously diagonalized $^*$-congruence.% by nonsingular matrix. Interestingly, one leads to existence positive definite solution semidefinite program (SDP). From practical point view, propose an algorithm numerically problem. The proposed is combination (1) detecting whether initial matrices are diagonalizable $*$-congruence, and (2) Jacobi-like $*$-congruence commuting normal derived from previous stage. Illustrating examples hand/coding in \textsc{Matlab} also presented.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence of Hermitian Matrices by Hermitian Matrices

Two Hermitian matrices A, B ∈ Mn(C) are said to be Hermitian-congruent if there exists a nonsingular Hermitian matrix C ∈ Mn(C) such that B = CAC. In this paper, we give necessary and sufficient conditions for two nonsingular simultaneously unitarily diagonalizable Hermitian matrices A and B to be Hermitian-congruent. Moreover, when A and B are Hermitian-congruent, we describe the possible iner...

متن کامل

Joint Approximate Diagonalization of Positive Deenite Hermitian Matrices

This paper provides an iterative algorithm to jointly approximately di-agonalize K Hermitian positive deenite matrices ? 1 , : : : , ? K. Speciically it calculates the matrix B which minimizes the criterion P K k=1 n k log det diag(BC k B) ? log det(BC k B)], n k being positive numbers, which is a measure of the deviation from diagonality of the matrices BC k B. The convergence of the algorithm...

متن کامل

Numerical Solution of Optimal Control of Time-varying Singular Systems via Operational Matrices

In this paper, a numerical method for solving the constrained optimal control of time-varying singular systems with quadratic performance index is presented. Presented method is based on Bernste in polynomials. Operational matrices of integration, differentiation and product are introduced and utilized to reduce the optimal control of time-varying singular problems to the solution of algebraic ...

متن کامل

Ela Hermitian Octonion Matrices and Numerical Ranges

Notions of numerical ranges and joint numerical ranges of octonion matrices are introduced. Various properties of hermitian octonion matrices related to eigenvalues and convex cones, such as the convex cone of positive semidefinite matrices, are described. As an application, convexity of joint numerical ranges of 2×2 hermitian matrices is characterized. Another application involves existence of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2022

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/21m1390657